GRASP and path relinking for the matrix bandwidth minimization
نویسندگان
چکیده
منابع مشابه
GRASP and path relinking for the matrix bandwidth minimization
In this article we develop a greedy randomized adaptive search procedure (GRASP) for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix, which keeps the nonzero elements in a band that is as close as possible to the main diagonal. The proposed method may be coupled with a Path Relinking strategy to search f...
متن کاملGrasp with Exterior Path Relinking for Differential Dispersion Minimization
We propose several new hybrid heuristics for the differential dispersion problem are proposed, the best of which consists of a GRASP with sampled greedy construction with variable neighborhood search for local improvement. The heuristic maintains an elite set of high-quality solutions throughout the search. After a fixed number of GRASP iterations, exterior path relinking is applied between all...
متن کاملGRASP and Path Relinking for the
In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional two-staged cutting stock problem. This is a special cutting problem in which the cut is performed in two phases. In the first phase, the stock rectangle is slit down its width into different vertical strips and in the second phase, each of these strips is processed to obtain the f...
متن کاملGRASP with path-relinking for the QAP
The quadratic assignment problem (QAP) was first proposed by Koopmans and Beckman [5] in the context of the plant location problem. Given n facilities, represented by the set F f1 fn , and n locations represented by the set L l1 ln , one must determine to which location each facility must be assigned. Let An n ai j be a matrix where ai j represents the flow between facilities fi and f j. Let Bn...
متن کاملMultiobjective GRASP with Path Relinking
In this paper we propose an adaptation of the GRASP metaheuristic to solve multi-objective combinatorial optimization problems. In particular we describe several alternatives to specialize the construction and improvement components of GRASP when two or more objectives are considered. GRASP has been successfully coupled with path-relinking for single-objective optimization. In this paper, we pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2004
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(02)00715-4